Comparing mostly-copying and mark-sweep conservative collection

Mostly-Copying Collection: A Viable Alternative to Conservative Mark-Sweep

Many high-level language compilers generate C code and then invoke a C compiler to do code generation, register allocation, stack management, and low-level optimization. To date, most of these compilers link the resulting code against a conservative mark-sweep garbage collector in order to reclaim unused memory. We introduce a new collector, MCC, based on mostly-copying collection, and characte...

Lock-free parallel garbage collection by Mark&Sweep

This paper presents a lock-free parallel algorithm for mark&sweep garbage collection (GC) in a realistic model using synchronization primitives load-linked (LL)/store-conditional (SC) or compare-and-swap (CAS) offered by machine architectures. Mutators and collectors can simultaneously operate on the data structure. In particular no strict alternation between usage and cleaning up is necessary ...

Lock-free parallel garbage collection by Mark&Sweep

This paper presents a lock-free parallel algorithm for mark&sweep garbage collection (GC) in a realistic model using synchronization primitives load-linked (LL)/store-conditional (SC) or compare-and-swap (CAS) offered by machine architectures. Mutators and collectors can simultaneously operate on the data structure. In particular no strict alternation between usage and cleaning up is necessary ...

Mark DURING Sweep rather than Mark THEN Sweep

Garbage Collection frees the programmer from the burden of explicitly deallocating unused data. This facility induces a considerable overhead but also causes some delays that may aaect real-time applications. Guaranteed throughput (with at most short and predictable delays) is needed in many applications such as plane or plant control and requires at least a worst case analysis to identify the ...

Copying Garbage Collection for the WAM: To Mark or Not to Mark?